Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
371	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
372	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 A Lower Bound on the Area of a 3-Coloured Disc Packing Peter Brass∗ Ferran Hurtado† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:35 Discrete geometry Computational geometry Lattice points Order theory Diagrams Voronoi diagram Lattice Total order Packing problem Mathematics Geometry Abstract algebra
373	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-05 11:21:00 Complexity classes Polygons Structural complexity theory Mathematical optimization Art gallery problem Approximation algorithm Reduction NP-complete Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
374	CCCG 2010, Winnipeg MB, August 9–11, 2010 Watchman tours for polygons with holes Adrian Dumitrescu∗ Abstract. A watchman tour in a polygonal domain (for Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:16 Theoretical computer science Computational geometry Euclidean plane geometry Simple polygon Art gallery problem Polygon Travelling salesman problem Induced path Geometry Mathematics Polygons
375	ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:39 NP-complete problems Travelling salesman problem Independent set NP-complete Set cover problem NP Directed acyclic graph Kernelization Vertex cover Theoretical computer science Computational complexity theory Mathematics
376	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics
377	16th Canadian Conference on Computational Geometry, 2004 An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Measure of the Union of Hyperrectangles in Dimensions Susumu Suzuki Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Operations research NP-complete problems Search algorithms Analysis of algorithms Boolean satisfiability problem Backtracking Algorithm PP Time complexity Theoretical computer science Applied mathematics Computational complexity theory
378	On Rank Aggregation of Multiple Orderings in Network Design Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel Lisa Zhang, Bell Labs, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-03-07 16:59:32 Complexity classes Mathematical optimization Structural complexity theory Conjectures Permutation NP Directed acyclic graph Optimization problem Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
379	Optimal Convex Partitions of Point Sets with Few Inner Points Andreas Spillner∗ Abstract We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:54 Mathematical optimization Computational geometry Dynamic programming Equations Systems engineering Algorithm Travelling salesman problem Convex hull Kirkpatrick–Seidel algorithm Operations research Mathematics Applied mathematics
380	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE